#include <iostream>
#include <random>

std::mt19937 mt_rand(time(0));

int sumOfPrimes(int num) {
	std::vector<bool> isPrime(num+1, true);
    	isPrime[0] = false;
    	isPrime[1] = false;
    	for (int i = 2; i <= sqrt(num); i++) {
        	if (isPrime[i]) {
            	for (int j = i*i; j <= num; j += i) {
                	isPrime[j] = false;
        	}
	}
}

    long sum = 0;
    for (int i = 2; i <= num; i++) {
std::cout<<isPrime[i]<<std::endl;  
      if (isPrime[i]) {
            sum += i;
//		std::cout<<isPrime[i]<<std::endl;	 
        }
    }
    return sum;
}

long prepare(long num){
	int sum=0;
	sum = sumOfPrimes(num/100);
	return sum;
}




long hash(long num) {

	long sum = prepare(num);
	return sum%100;

}

int main() {
	long key;
	std::cin>>key;
	int flag = 0;
	if (hash(key) == key%100) flag = 1;
	else flag = 0;
	std::cout<<"your key is "<<flag<<std::endl;
}


